-
1 hierarchy theorem
Математика: теорема об иерархии -
2 hierarchy theorem
-
3 hierarchy theorem
мат. -
4 analytical hierarchy theorem
Математика: теорема об аналитической иерархииУниверсальный англо-русский словарь > analytical hierarchy theorem
-
5 arithmetical hierarchy theorem
Математика: теорема об арифметической иерархииУниверсальный англо-русский словарь > arithmetical hierarchy theorem
-
6 analytical hierarchy theorem
English-Russian scientific dictionary > analytical hierarchy theorem
-
7 arithmetical hierarchy theorem
English-Russian scientific dictionary > arithmetical hierarchy theorem
-
8 theorem
- analytical hierarchy theorem - arithmetical hierarchy theorem - closed range theorem - formally provable theorem - implicit function theorem - initial value theorem - integral representation theorem - local limit theorem - maximal ergodic theorem - mean value theorem - normal form theorem - ratio limit theorem - rational root theorem - second mean value theorem - theorem of consistency proofs - theorem of corresponding states - three line theorem - three series theorem - uniform convergence theorem - uniform ergodic theorem - uniform mean value theoremtheorem implies — из теоремы следует, что…
-
9 theorem
- theorem of total probability
- acoustical reciprocity theorem
- Ampere's circuital theorem
- average theorem
- Bayes theorem
- Birkhoff-von Neumann theorem
- Bloch theorem
- Brouwer fixed-point theorem
- Cayley theorem - Chinese residue theorem
- compensation theorem
- completeness theorem
- constant-flux-linkage theorem
- Coopmans theorem
- CPT-theorem
- Cramer theorem
- current sheet theorem
- Dilworth theorem
- divergence theorem
- Floquet theorem
- Foster's reactance theorem
- Fourier theorem
- fuzzy theorem
- fuzzy approximation theorem
- Gauss theorem
- Gauss-Markov theorem
- Gödel's theorem
- Gödel's incompleteness theorem
- Hecht-Nielsen theorem
- hierarchy theorem
- Kolmogorov theorem
- Kolmogorov-Arnold theorem
- limit theorem
- logic theorem
- Lüders-Pauli theorem
- Manley-Rowe theorem
- matching theorem
- McCulloh-Pitts theorem
- Mermin-Wagner theorem
- Nyquist's theorem
- Poincare-Birkhoff theorem
- Poynting's theorem
- reciprocity theorem
- Radon theorem
- Routh-Hurwitz theorem
- sampling theorem
- selection theorem
- semantic theorem
- Shannon theorem
- Slutsky's theorem
- Stokes theorem
- Stone theorem
- superposition theorem
- syntactical theorem
- Takens theorem
- Thevenin's theorem
- unicity theorem
- Weierstrass theorem
- Wiener-Khintchin theorem
- Zorn theorem -
10 теорема об иерархии
Большой англо-русский и русско-английский словарь > теорема об иерархии
-
11 system
1) система; комплекс2) совокупность•- absolutely consistent system - absolutely direct indecomposable system - absolutely free system - absolutely irreducible system - absolutely isolated system - allowable coordinate system - almost linear system - ample linear system - artificial feel system - automatic block system - automatic deicing system - binary relational system - binary-coded decimal system - block tooling system - Cartesian coordinate system - completely controllable system - completely ergodic system - completely hyperbolic system - completely identifiable system - completely integrable system - completely irreducible system - completely regular system - completely stable system - completely stratified system - complex number system - conical coordinate system - derivational formal system - differential equation system - differential selsyn system - digital counting system - digital transmission system - elliptic coordinate system - elliptic cylindrical coordinate system - externally inconsistent system - finite state system - finitely axiomatizable system - finitely presented system - fully characteristic quotient system - fundamental system of solutions - hydraulic lift system - integrated switching system - isomorphically embedded system - kernel normal system - linearly dependent system - linearly independent system - live hydraulic system - locking protection system - meteor-burst communication system - modular programming system - parabolic cylindrical coordinate system - permanent four-wheel drive system - pure independent system - radio telephone system - reactor protection system - real number system - receiver-amplifier crioelectric system - remote-cylinder hydraulic system - semantically consistent system - simply consistent system - simply incomplete system - simply ordered system - spherical coordinate system - strongly multiplicative system - structurally stable system - sufficiently general coordinate system - system of frequency curves - system of rational numbers - time multiplex system - time-division multiplex system - uniformly complete system - univalent system of notation - universal system of notation - weakly closed system - weighted number system
См. также в других словарях:
Space hierarchy theorem — In computational complexity theory, the space hierarchy theorems are separation results that show that both deterministic and nondeterministic machines can solve more problems in (asymptotically) more space, subject to certain conditions. For… … Wikipedia
Time hierarchy theorem — In computational complexity theory, the time hierarchy theorems are important statements about time bounded computation on Turing machines. Informally, these theorems say that given more time, a Turing machine can solve more problems. For example … Wikipedia
Hierarchy problem — In theoretical physics, a hierarchy problem occurs when the fundamental parameters (couplings or masses) of some Lagrangian are vastly different (usually larger) than the parameters measured by experiment. This can happen because measured… … Wikipedia
Exponential hierarchy — In computational complexity theory, the exponential hierarchy is a hierarchy of complexity classes, starting with EXP:: m{EXP} = igcup {kinmathbb{N mbox{DTIME}left(2^{n^k} ight)and continuing with: m{2EXP} = igcup {kinmathbb{N… … Wikipedia
Post's theorem — In computability theory Post s theorem, named after Emil Post, describes the connection between the arithmetical hierarchy and the Turing degrees. Background The statement of Post s theorem requires several concepts relating to definability and… … Wikipedia
Tarski's undefinability theorem — Tarski s undefinability theorem, stated and proved by Alfred Tarski in 1936, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics. Informally, the theorem states that arithmetical truth… … Wikipedia
Borel determinacy theorem — In descriptive set theory, the Borel determinacy theorem shows that any Gale Stewart game whose winning set is a Borel set is determined, meaning that one of the two players will have a winning strategy for the game. It was proved by Donald A.… … Wikipedia
Sipser-Lautemann theorem — In computational complexity theory, the Sipser Lautemann theorem or Sipser Gács Lautemann theorem states that BPP (Bounded error Probablistic Polynomial) time, is contained in the polynomial time hierarchy, and more specifically Sigma;2 cap; Pi;2 … Wikipedia
Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… … Wikipedia
Toda's theorem — The Toda s Theorem was proven by Seinosuke Toda in his paper PP is as Hard as the Polynomial Time Hierarchy (1991) and was given 1998 Gödel Prize. The theorem considers solution counting for polynomial problem class PP and polynomial hierarchy PH … Wikipedia
Arithmetical hierarchy — In mathematical logic, the arithmetical hierarchy, arithmetic hierarchy or Kleene hierarchy classifies certain sets based on the complexity of formulas that define them. Any set that receives a classification is called arithmetical. The… … Wikipedia
